Cme 305 :
نویسنده
چکیده
At lunchtime it’s crucial for people to get to the food trucks as quickly as possible. The building is represented by a graph G = (V,E) where each room, landing, or other location is represented by a vertex and each corridor or stairway is represented by an edge. Each corridor has associated capacity c, meaning that at most c people can pass through the corridor at once. Traversing a corridor from one end to the other takes one timestep and people can decide to stay in a room for the entire timestep.
منابع مشابه
CME 305: Discrete Mathematics and Algorithms
Solution: Let G be a disconnected graph in which case we can decompose it into k connected components C1, C2, . . . , Ck. We want to show that G is connected i.e. there is a path between any u and v in G. In the case that u and v are in different components we know that there exist an edge (a path of length one) between them in G. In the case that u and v are in the same component, say Ci, we c...
متن کاملCME 305: Discrete Mathematics and Algorithms
There are two main topics we cover in this lecture. First, we introduce and study matroids a generalization of spanning trees and the notion of independence that embody the greedy algorithm we saw last class. Second, we start a new problem, the maximum ow problem. In some sense, todays lecture is about one of the easiest and hardest problems in combinatorial optimization for which we have reaso...
متن کاملCME 305: Discrete Mathematics and Algorithms
1. (Kleinberg Tardos 7.27) Some of your friends with jobs out West decide they really need some extra time each day to sit in front of their laptops, and the morning commute from Woodside to Palo Alto seems like the only option. So they decide to carpool to work. Unfortunately, they all hate to drive, so they want to make sure that any carpool arrangement they agree upon is fair and doesn’t ove...
متن کاملCME 305: Discrete Mathematics and Algorithms
In this lecture we be begin our tour of discrete mathematics and algorithms by looking at one of the most fundamental and classic problems in combinatorial optimization and graph theory, computing the edge connectivity of an undirected, unweighted graph. In the next few lectures we will take a more principled and fundamental approach to graph theory and connectivity. The goal of today is to get...
متن کاملCME 305: Discrete Mathematics and Algorithms
1. (Kleinberg Tardos 7.27) Some of your friends with jobs out West decide they really need some extra time each day to sit in front of their laptops, and the morning commute from Woodside to Palo Alto seems like the only option. So they decide to carpool to work. Unfortunately, they all hate to drive, so they want to make sure that any carpool arrangement they agree upon is fair and doesn’t ove...
متن کامل